convolutional tuRbo codes on aWgn and flat Rayleigh fading channels

نویسندگان

  • Narushan Pillay
  • HongJun Xu
  • Fambirai Takawira
چکیده

Vol. 106 No. 9/10 Page 1 of 11 ABSTRACT Repeat-punctured turbo codes, an extension of the conventional turbo-coding scheme, has shown a significant increase in bit-error rate performance at moderate to high signal-to-noise ratios for short frame lengths. Superorthogonal convolutional turbo codes (SCTC) makes use of superorthogonal signals to improve the performance of the conventional turbo codes and a coding scheme that applies the repeat-punctured technique into SCTC has shown to perform better. We investigated two new low-rate coding schemes, repeat-punctured superorthogonal convolutional turbo codes (RPSCTC) and dual-repeat-punctured superorthogonal convolutional turbo codes (DRPSCTC), that make use of superorthogonal signaling, together with repetition and puncturing, to improve the performance of SCTC for reliable and effective communications. Simulation results in the additive white Gaussian noise (AWGN) channel and the frequency non-selective Rayleigh fading channel are presented together with analytical bounds of bit error probabilities, derived from transfer function bounding techniques. From the simulation results and the analytical bounds presented, it is evident that RPSCTC and DRPSCTC offer a more superior performance than SCTC in the AWGN channel, as well as in flat Rayleigh non-line-of-sight fading channels. The distance spectrum is also presented for the new schemes and accounts for the performance improvement rendered in simulations. It is important to note that the improved performance that SCTC, and consequently RPSCTC and DRPSCTC, exhibit is achieved at the expense of bandwidth expansion and complexity and would be ideal for power-limited satellite communication links or interference-limited systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeat - punctuRed supeRoRthogonal convolutional tuRbo codes on aWgn and flat Rayleigh fading channels

Vol. 106 No. 9/10 Page 1 of 11 ABSTRACT Repeat-punctured turbo codes, an extension of the conventional turbo-coding scheme, has shown a significant increase in bit-error rate performance at moderate to high signal-to-noise ratios for short frame lengths. Superorthogonal convolutional turbo codes (SCTC) makes use of superorthogonal signals to improve the performance of the conventional turbo cod...

متن کامل

The Turbo-codes Performances in the (Radio) Rice Flat Fading Channels

The received signal from (radio) Rice flat fading transmission channels has both unfading (like in the AWGN –Additive White Gaussian Noise channel) and fading components (like in the Rayleigh channel). In this paper the BER (Bit Error Rate) and FER (Frame Error Rate) TCs (turbo codes) performances provided by the simulations of the way of the TCs work in the Rice flat fading (frequency unselect...

متن کامل

Hybrid ARQ using Serial Concatenated Convolutional Codes over Fading Channels

In this paper, we propose and analyze a new hybrid FEC/ARQ scheme using rate compatible punctured serial concatenated convolutional codes (SCCCs) which is suitable for flat-fading channels. Puncturing increases the transmitted code rate, and the rate compatibility criterion allows incremental redundancy to be transmitted after each decoding failure according to a code-combining type-II Hybrid A...

متن کامل

Iterative Threshold Decoding of Majority Logic Decodable Codes on Rayleigh Fading Channels

Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algo...

متن کامل

List decoding of turbo codes

List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise (AWGN) and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those for convolutional codes. Finally, a practica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010